Binary operations in spherical convex geometry

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Convex Geometry of Binary Linear Codes

A code polytope is defined to be the convex hull in R n of the points in {0, 1}n corresponding to the codewords of a binary linear code. This paper contains a collection of results concerning the structure of such code polytopes. A survey of known results on the dimension and the minimal polyhedral representation of a code polytope is first presented. We show how these results can be extended t...

متن کامل

Binary Operations

Let A be a set. A unary operation on A is a function from A into A. A binary operation on A is a function from [:A, A :] into A. We adopt the following convention: u is a unary operation on A, o, o′ are binary operations on A, and a, b, c, e, e1, e2 are elements of A. In this article we present several logical schemes. The scheme BinOpEx deals with a non empty set A and a ternary predicate P , ...

متن کامل

Binary Spherical Geometric Codes

Let q be a power of an odd prime number and Fq be the finite field with q elements. We will construct a binary spherical code from an algebraic curve C defined over Fq and a rational divisor G on C, as the twist by the quadratic character 11 of the Goppa code L(G). The computation of the parameters of this code is based on the study of some character sums. 0. Introduction. In a previous paper (...

متن کامل

Spherical Binary Images Matching

In this paper a novel algorithm is presented to match the spherical binary images by measuring the maximal superposition degree between them. Experiments show that our method can match spherical binary images in a more accurate way.

متن کامل

Convex Approximation by Spherical Patches

Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indiana University Mathematics Journal

سال: 2016

ISSN: 0022-2518

DOI: 10.1512/iumj.2016.65.5867